from collections import *
import sys
import threading
def get_int():
return int(input())
def get_nums():
return list(map(int, input().split()))
def main():
n = get_int()
graph = defaultdict(list)
count = [0]*(n + 1)
dp = [0]*(n + 1)
dp2 = [0]*(n + 1)
ans = 0
for _ in range(n - 1):
a, b = get_nums()
graph[a].append(b)
graph[b].append(a)
def dfs1(root, parent):
count[root] = 1
for child in graph[root]:
if child != parent:
dfs1(child, root)
count[root] += count[child]
dp[root] += dp[child]
dp[root] += count[root]
def dfs2(root, parent):
nonlocal ans
for child in graph[root]:
if child != parent:
root_value = dp[root] - count[child] - dp[child]
cur_value = dp[child] + n - count[child]
dp[child] = max(dp[child], root_value + cur_value)
dfs2(child, root)
dfs1(1, -1)
dfs2(1, -1)
print(max(dp))
threading.stack_size(1<<27)
sys.setrecursionlimit(1<<30)
main_thread = threading.Thread(target = main)
main_thread.start()
main_thread.join()/*
███████╗ ░░░░░░ ██╗░░██╗ ███████╗ ███╗░░██╗ ███████╗
╚════██║ ░░░░░░ ██║░██╔╝ ██╔════╝ ████╗░██║ ╚════██║
░░███╔═╝ █████╗ █████═╝░ █████╗░░ ██╔██╗██║ ░░░░██╔╝
██╔══╝░░ ╚════╝ ██╔═██╗░ ██╔══╝░░ ██║╚████║ ░░░██╔╝░
███████╗ ░░░░░░ ██║░╚██╗ ███████╗ ██║░╚███║ ░░██╔╝░░
╚══════╝ ░░░░░░ ╚═╝░░╚═╝ ╚══════╝ ╚═╝░░╚══╝ ░░╚═╝░░░
*/
#include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define INFI INT32_MAX
#define INFL INT64_MAX
#define endl '\n'
#define yn(flag) cout << ((flag) ? "YES" : "NO") << endl
typedef long long ll; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<vvi> vvvi; typedef vector<long long> vl;
typedef vector<vl> vvl; typedef vector<vvl> vvvl; typedef vector<string> vs; typedef vector<vs> vvs;
typedef vector<bool> vb; typedef vector<vb> vvb; typedef pair<int, int> pii; typedef pair<ll, ll> pll;
typedef pair<ll, int> pli; typedef pair<int, ll> pil; typedef vector<pii> vpii;
const int diri[8] = { -1, 0, 0, 1, -1, -1, 1, 1 }; const int dirj[8] = { 0, 1, -1, 0, -1, 1, -1, 1 };
template<typename T,typename V> ostream& operator<<(ostream &s,pair<T,V> t) {return s<<"{"<<t.first<<","<<t.second<<"}";}
template<typename T> ostream& operator<<(ostream &s,vector<T> t) {s << "[";for (int i = 0; i < t.size(); ++i) {s << t[i];
if (i != t.size() - 1) {s << ", ";}}s << "]";return s;}
template<typename T, typename V> ostream& operator<<(ostream &s,map<T, V> t) {s << "{";for (auto& a : t) {s << a << " ";} s << "}";return s;}
template<typename T> ostream& operator<<(ostream &s, set<T> t) {s << "{";for (auto& a : t) {s << a << ", ";} s << "}";return s;}
template<typename... T> void put(T&&... args) { ((cout << args << " "), ...);}
template<typename... T> void putl(T&&... args) { ((cout << args << " "), ...); cout<<'\n';}
template<typename T> void input(vector<T>& t) { for (auto& v : t) cin >> v; }
const int mod = 1e9+7;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
int n; cin >> n;
vector<vector<int>> graph(n + 1);
for (int i = 0; i < n - 1; ++i) {
int a, b;
cin >> a >> b;
graph[a].push_back(b);
graph[b].push_back(a);
}
vector<int> dp(n + 1); // Number of nodes
function<int(int, int)> init_dfs = [&](int v, int p) {
int count = 1;
for (auto to : graph[v])
if (to != p)
count += init_dfs(to, v);
return dp[v] = count;
};
init_dfs(1, -1);
long long sum = accumulate(dp.begin(), dp.end(), 0LL);
long long res = sum;
function<void(int, int, long long)> dfs = [&](int v, int p, long long current_res) {
res = max(res, current_res);
for (auto to : graph[v])
if (to != p)
dfs(to, v, current_res + n - 2 * dp[to]);
};
dfs(1, -1, res);
cout << res << endl;
return 0;
}
/* Try this if you are stuck:
1) Maybe binary search on answer?
2) Try solving it in reverse
3) Think of a simple problem
4) Think of elements which are special
(like minimum, maximum, deepest node in tree, root)
5) Is it graph problem?
*/
/* DONT FORGET:
EDGE CASES!!!!!
N = 1,2...
LONG LONG INSTEAD OF INT??
*/46. Permutations | 226. Invert Binary Tree |
112. Path Sum | 1556A - A Variety of Operations |
136. Single Number | 169. Majority Element |
119. Pascal's Triangle II | 409. Longest Palindrome |
1574A - Regular Bracket Sequences | 1574B - Combinatorics Homework |
1567A - Domino Disaster | 1593A - Elections |
1607A - Linear Keyboard | EQUALCOIN Equal Coins |
XOREQN Xor Equation | MAKEPAL Weird Palindrome Making |
HILLSEQ Hill Sequence | MAXBRIDGE Maximise the bridges |
WLDRPL Wildcard Replacement | 1221. Split a String in Balanced Strings |
1002. Find Common Characters | 1602A - Two Subsequences |
1555A - PizzaForces | 1607B - Odd Grasshopper |
1084A - The Fair Nut and Elevator | 1440B - Sum of Medians |
1032A - Kitchen Utensils | 1501B - Napoleon Cake |
1584B - Coloring Rectangles | 1562B - Scenes From a Memory |